Massively parallel chemical potential calculation on graphics processing units
نویسندگان
چکیده
Oneand two-stage free energy methods are common approaches for calculating the chemical potential from a molecular dynamics or Monte Carlo molecular simulation trajectory. Although these methods require significant amounts of CPU time spent on post-simulation analysis, this analysis step is wellsuited for parallel execution. In this work, we implement this analysis step on graphics processing units (GPUs), an architecture that is optimized for massively parallel computation. A key issue in porting these free energy methods to GPUs is the trade-off between software efficiency and sampling efficiency. In particular, fixed performance costs in the software favor a higher number of insertion moves per configuration. However, higher numbers of moves lead to lower sampling efficiency. We explore this issue in detail, and find that for a dense, strongly interacting system of small molecules like liquid water, the optimal number of insertions per configuration can be as high as 105 for a two-stage approach like Bennett’s method. We also find that our GPU implementation accelerates chemical potential calculations by as much as 60-fold when compared to an efficient, widely available CPU code running on a single CPU
منابع مشابه
Accelerating Dust Temperature Calculations with Graphics Processing Units
When calculating the infrared spectral energy distributions (SEDs) of galaxies in radiation-transfer models, the calculation of dust grain temperatures is generally the most time-consuming part of the calculation. Because of its highly parallel nature, this calculation is perfectly suited for massively parallel general-purpose Graphics Processing Units (GPUs). This paper presents an implementat...
متن کاملInvestigating the Effects of Hardware Parameters on Power Consumptions in SPMV Algorithms on Graphics Processing Units (GPUs)
Although Sparse matrix-vector multiplication (SPMVs) algorithms are simple, they include important parts of Linear Algebra algorithms in Mathematics and Physics areas. As these algorithms can be run in parallel, Graphics Processing Units (GPUs) has been considered as one of the best candidates to run these algorithms. In the recent years, power consumption has been considered as one of the metr...
متن کاملGravitational tree-code on graphics processing units: implementation in CUDA
We present a new very fast tree-code which runs on massively parallel Graphical Processing Units (GPU) with NVIDIA CUDA architecture. The tree-construction and calculation of multipole moments is carried out on the host CPU, while the force calculation which consists of tree walks and evaluation of interaction list is carried out on the GPU. In this way we achieve a sustained performance of abo...
متن کاملMassively Parallel Genetic Algorithm – Pattern Search for Nonlinear Optimization with GPU Computing
This paper presents a massively parallel Genetic Algorithm – Pattern Search (GA-PS) with graphics hardware acceleration on bound constrained nonlinear optimization problems. The objective of this study is to determine the effectiveness of using Graphics Processing Units (GPU) as a hardware platform for Genetic Algorithms (GA). The global search of the GA is enhanced by a local Pattern Search (P...
متن کاملOn the utility of graphics cards to perform massively parallel simulation with advanced Monte Carlo methods
We present a case-study on the utility of graphics cards to perform massively parallel simulation with advanced Monte Carlo methods. Graphics cards, containing multiple Graphics Processing Units (GPUs), are self-contained parallel computational devices that can be housed in conventional desktop and laptop computers. For certain classes of Monte Carlo algorithms they offer massively parallel sim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Physics Communications
دوره 183 شماره
صفحات -
تاریخ انتشار 2012